First order properties on nowhere dense structures

نویسندگان

  • Jaroslav Nesetril
  • Patrice Ossona de Mendez
چکیده

A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special classes of structures (such as minor closed families). This in turn led to the notions of wide, almost wide and quasiwide classes of graphs. It has been proved previously that minor closed classes and classes of graphs with locally forbidden minors are examples of such classes and thus (relativized) homomorphism preservation theorem holds for them. In this paper we show that (more general) classes with bounded expansion and (newly defined) classes with bounded local expansion and even (very general) nowhere dense classes are quasi wide. This not only strictly generalizes the previous results but it also provides new proofs and algorithms for some of the old results. It appears that bounded expansion and nowhere dense classes are perhaps a proper setting for investigation of wide-type classes as in several instances we obtain a structural characterization. This also puts classes of bounded expansion in the new context. Our motivation stems from finite dualities. As a corollary we obtain that any homomorphism closed first order definable property restricted to a bounded expansion class is a restricted duality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Combinatorial Structures: Classification and Applications

We present results of the recent research on sparse graphs and finite structures in the context of of contemporary combinatorics, graph theory, model theory and mathematical logic, complexity of algorithms and probability theory. The topics include: complexity of subgraphand homomorphismproblems; model checking problems for first order formulas in special classes; property testing in sparse cla...

متن کامل

Enumeration for FOQueries over Nowhere Dense Graphs

We consider the evaluation of first-order queries over classes of databases that are nowhere dense. The notion of nowhere dense classes was introduced by Nešetřil and Ossona de Mendez as a formalization of classes of “sparse” graphs and generalizes many well-known classes of graphs, such as classes of bounded degree, bounded treewidth, or bounded expansion. It has recently been shown by Grohe, ...

متن کامل

On the number of types in sparse graphs

We prove that for every class of graphs C which is nowhere dense, as defined by Nešetřil and Ossona de Mendez [27, 28], and for every first order formula φ(x̄, ȳ), whenever one draws a graph G ∈ C and a subset of its nodes A, the number of subsets of A|ȳ| which are of the form {v̄ ∈ A|ȳ| : G |= φ(ū, v̄)} for some valuation ū of x̄ in G is bounded by O(|A||x̄|+ε), for every ε > 0. This provides optim...

متن کامل

Parameterized Complexity of First-Order Logic

We show that if C is a class of graphs which is nowhere dense then rst-order model-checking is xed-parameter tractable on C. As all graph classes which exclude a xed minor, or are of bounded local tree-width or locally exclude a minor are nowhere dense, this generalises algorithmic meta-theorems obtained for these classes in the past (see [11, 13, 4]). Conversely, if C is not nowhere dense and ...

متن کامل

On nowhere dense and somewhere dense - a graph trichotomy

Motivated by structural decompositions and other asymptotic properties of graphs we define the notions in the title and show the wide spectrum of examples of nowhere dense graphs. This has several algorithmic consequences and it generalizes and improves earlier results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 75  شماره 

صفحات  -

تاریخ انتشار 2010